Supporting user-defined functions on uncertain data
نویسندگان
چکیده
منابع مشابه
Supporting User-Defined Functions on Uncertain Data
Uncertain data management has become crucial in many sensing and scientific applications. As user-defined functions (UDFs) become widely used in these applications, an important task is to capture result uncertainty for queries that evaluate UDFs on uncertain data. In this work, we provide a general framework for supporting UDFs on uncertain data. Specifically, we propose a learning approach ba...
متن کاملQueries on Databases With User-Defined Functions
The notion of a database query is generalized for databases with user-defined functions. Then, we can prove that the computable queries coincide with those expressible by an extension of the relational machine, with oracles ([4]). This implies that any complete query language, extended with user-defined function symbols in a "reasonable" way, is still complete. We give an example of a complete ...
متن کاملUser Defined Spreadsheet Functions in Excel
Creating user defined functions (UDFs) is a powerful method to improve the quality of computer applications, in particular spreadsheets. However, the only direct way to use UDFs in spreadsheets is to switch from the functional and declarative style of spreadsheet formulas to the imperative VBA, which creates a high entry barrier even for proficient spreadsheet users. It has been proposed to ext...
متن کاملCLOS discriminating functions and user-defined specializers
We discuss the possibility for users of CLOS to extend the mop:specializer metaobject class in the de facto standard Metaobject Protocol for Common Lisp, and how this possibility interacts with ANSI-standardized functionality. To motivate the discussion, we provide two simple examples: a specializer on a disjunction of classes and a simple pattern-matching specializer; we note the extent to whi...
متن کاملProcessing Joins with User-Defined Functions
Most strategies for the computation of relational joins (such as sort-merge or hash-join) are facing major diiculties if the join predicate involves complex, user-deened functions rather than just simple arithmetic comparisons. In this paper, we identify a class of user-deened functions that can be included in a join predicate, such that a join between two sets R and S can still be computed eec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2013
ISSN: 2150-8097
DOI: 10.14778/2536336.2536347